On Unifying Assumption-Commitment Style Proof Rules for Concurrency
نویسندگان
چکیده
Assumption{Commitment paradigms for speciication and veriication of concurrent programs have been proposed in the past. We show that two typical parallel composition rules for shared variable and message passing programs 8, 12] which hitherto required diierent formulations are instances of one general rule mainly inspired by Abadi & Lamport's composition theorem 1].
منابع مشابه
Parallel Composition of Assumption-commitment Speciications a Unifying Approach for Shared Variable and Distributed Message Passing Concurrency
We unify the parallel composition rule of assumption-commitment speciications for respectively state-based and message-based concurrent processes. Without providing language-dependent deenitions, we rst assume that the model of a process can be given as a set of`sequences' (e.g., traces, state sequences). Then we assume the existence of a merging operator that captures the compositionality of t...
متن کاملOn Unifying Assumption { Commitment
Assumption{Commitment paradigms for speciication and veriication of concurrent programs have been proposed in the past. We show that two typical parallel composition rules for shared variable and message passing programs 8, 12] which hitherto required diierent formulations are instances of one general rule mainly inspired by Abadi & Lamport's composition theorem 1].
متن کاملAlgebraic Principles for Rely-Guarantee Style Concurrency Verification Tools
We provide simple equational principles for deriving relyguarantee-style inference rules and refinement laws based on idempotent semirings. We link the algebraic layer with concrete models of programs based on languages and execution traces. We have implemented the approach in Isabelle/HOL as a lightweight concurrency verification tool that supports reasoning about the control and data flow of ...
متن کاملA Concurrency Control Scheme for Nested Transactions
Locking rules for concurrency control in nested transaction model, in which parent/child parallelism, sibling parallelism, and arbitrary commitment-dependence relationship between transactions are allowed, are presented. The locking rules are based on the lock transformation scheme that never allows the commit deadlock to occur, which could happen by permitting parent/child parallelism. In addi...
متن کاملA Compositional Proof Theory for Real-Time Distributed Message Passing
A compOSitional proof system is given for an OCCAM-like real-time programming language for distributed computing with communication via synchronous message passing. This proof system is based on speCifications of processes which are independent of the program text of these processes. These specifications state (1) the assumptions of a process about the behaViour of its environment, and (2) the ...
متن کامل